import java.util.Scanner;
public class Demo45{
    static int N = 100010,n,m,hh,tt,idx;
    static int[] e = new int[N],ne = new int[N],h = new int[N];
    static int[] q = new int[N];
    static int[] d = new int[N];
    public static void add(int a, int b){
        e[idx] = b;
        ne[idx] = h[a];
        h[a] = idx++;
    }
    public static boolean bfs(){
        hh = 0; tt = -1;
        for(int i = 1; i <= n; i++){
            if(d[i] == 0){
                q[++tt] = i;
            }
        }
        while(hh <= tt){
            int t = q[hh++];
            for(int i = h[t]; i != -1; i = ne[i]){
                int s = e[i];
                d[s] --;
                if(d[s] == 0){
                    q[++tt] = s;
                }
            }
        }
        return tt == n - 1;
    }
    public static void main(String[] args){
        Scanner scan = new Scanner(System.in);
        n = scan.nextInt();
        m = scan.nextInt();
        for(int i = 0; i < N; i++){
            h[i] = -1;
        }
        while(m -- > 0){
            int a = scan.nextInt();
            int b = scan.nextInt();
            add(a,b);
            d[b]++;
        }
        if(bfs()){
            for(int i = 0; i < n; i++){
                System.out.print(q[i] + " ");
            }
        }else{
            System.out.println("-1");
        }
    }
}